Cakes That Bake Cakes: Dynamic Computation in CakeML

We have extended the verified CakeML compiler with a new language primitive, Eval, which permits evaluation of syntax at runtime. This implementation supports an ambitious form compilation runtime and dynamic execution, where original dynamically added code can share (higher-order) values recursively call each other. is, to our knowledge, first run-time environment capable supporting standard LCF-style theorem prover design. Modifying modern pipeline proofs support computation semantics was extensive project. review design decisions, proof techniques, engineering lessons from project, highlight some unexpected complications.